Structural risk minimization for quantum linear classifiers
نویسندگان
چکیده
Quantum machine learning (QML) models based on parameterized quantum circuits are often highlighted as candidates for computing's near-term “killer application''. However, the understanding of empirical and generalization performance these is still in its infancy. In this paper we study how to balance between training accuracy (also called structural risk minimization) two prominent QML introduced by Havlí?ek et al. \cite{havlivcek:qsvm}, Schuld Killoran \cite{schuld:qsvm}. Firstly, using relationships well understood classical models, prove that model parameters – i.e., dimension sum images Frobenius norm observables used closely control models' complexity therefore performance. Secondly, ideas inspired process tomography, also ability capture correlations sets examples. summary, our results give rise new options minimization models.
منابع مشابه
Empirical risk minimization for support vector classifiers
In this paper, we propose a general technique for solving support vector classifiers (SVCs) for an arbitrary loss function, relying on the application of an iterative reweighted least squares (IRWLS) procedure. We further show that three properties of the SVC solution can be written as conditions over the loss function. This technique allows the implementation of the empirical risk minimization...
متن کاملLearning Bayesian network classifiers by risk minimization
Article history: Received 22 June 2011 Received in revised form 1 October 2011 Accepted 24 October 2011 Available online 29 October 2011
متن کاملStructural Risk Minimization for Character Recognition
The method of Structural Risk Minimization refers to tuning the capacity of the classifier to the available amount of training data. This capacity is influenced by several factors, including: (1) properties of the input space, (2) nature and structure of the classifier, and (3) learning algorithm. Actions based on these three factors are combined here to control the capacity of linear classifie...
متن کاملStructural risk minimization using nearest neighbor rule
We present a novel nearest neighbor rule-based implementation of the structural risk minimization principle to address a generic classification problem. We propose a fast reference set thinning algorithm on the training data set similar to a support vector machine approach. We then show that the nearest neighbor rule based on the reduced set implements the structural risk minimization principle...
متن کاملDyadic Classification Trees via Structural Risk Minimization
Classification trees are one of the most popular types of classifiers, with ease of implementation and interpretation being among their attractive features. Despite the widespread use of classification trees, theoretical analysis of their performance is scarce. In this paper, we show that a new family of classification trees, called dyadic classification trees (DCTs), are near optimal (in a min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum
سال: 2023
ISSN: ['2521-327X']
DOI: https://doi.org/10.22331/q-2023-01-13-893